See maximum cut on Wiktionary
{
"forms": [
{
"form": "maximum cuts",
"tags": [
"plural"
]
}
],
"head_templates": [
{
"args": {},
"expansion": "maximum cut (plural maximum cuts)",
"name": "en-noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "noun",
"senses": [
{
"antonyms": [
{
"word": "minimum cut"
}
],
"categories": [
{
"kind": "other",
"name": "English entries with incorrect language header",
"parents": [
"Entries with incorrect language header",
"Entry maintenance"
],
"source": "w"
},
{
"kind": "other",
"name": "Pages with 1 entry",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Pages with entries",
"parents": [],
"source": "w"
},
{
"kind": "topical",
"langcode": "en",
"name": "Graph theory",
"orig": "en:Graph theory",
"parents": [
"Mathematics",
"Visualization",
"Formal sciences",
"Computing",
"Interdisciplinary fields",
"Sciences",
"Technology",
"All topics",
"Fundamental"
],
"source": "w"
}
],
"glosses": [
"A cut whose size is at least the size of any other cut; a partition of the graph's vertices into two complementary sets S and T, such that the number of edges between S and T is as large as possible."
],
"id": "en-maximum_cut-en-noun-Dmh3iZTp",
"links": [
[
"graph theory",
"graph theory"
],
[
"partition",
"partition"
],
[
"graph",
"graph"
],
[
"vertices",
"vertex"
],
[
"complementary",
"complementary"
],
[
"possible",
"possible"
]
],
"raw_glosses": [
"(graph theory) A cut whose size is at least the size of any other cut; a partition of the graph's vertices into two complementary sets S and T, such that the number of edges between S and T is as large as possible."
],
"topics": [
"graph-theory",
"mathematics",
"sciences"
]
}
],
"word": "maximum cut"
}
{
"forms": [
{
"form": "maximum cuts",
"tags": [
"plural"
]
}
],
"head_templates": [
{
"args": {},
"expansion": "maximum cut (plural maximum cuts)",
"name": "en-noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "noun",
"senses": [
{
"antonyms": [
{
"word": "minimum cut"
}
],
"categories": [
"English countable nouns",
"English entries with incorrect language header",
"English lemmas",
"English multiword terms",
"English nouns",
"Pages with 1 entry",
"Pages with entries",
"en:Graph theory"
],
"glosses": [
"A cut whose size is at least the size of any other cut; a partition of the graph's vertices into two complementary sets S and T, such that the number of edges between S and T is as large as possible."
],
"links": [
[
"graph theory",
"graph theory"
],
[
"partition",
"partition"
],
[
"graph",
"graph"
],
[
"vertices",
"vertex"
],
[
"complementary",
"complementary"
],
[
"possible",
"possible"
]
],
"raw_glosses": [
"(graph theory) A cut whose size is at least the size of any other cut; a partition of the graph's vertices into two complementary sets S and T, such that the number of edges between S and T is as large as possible."
],
"topics": [
"graph-theory",
"mathematics",
"sciences"
]
}
],
"word": "maximum cut"
}
Download raw JSONL data for maximum cut meaning in All languages combined (1.2kB)
This page is a part of the kaikki.org machine-readable All languages combined dictionary. This dictionary is based on structured data extracted on 2024-11-28 from the enwiktionary dump dated 2024-11-21 using wiktextract (65a6e81 and 0dbea76). The data shown on this site has been post-processed and various details (e.g., extra categories) removed, some information disambiguated, and additional data merged from other sources. See the raw data download page for the unprocessed wiktextract data.
If you use this data in academic research, please cite Tatu Ylonen: Wiktextract: Wiktionary as Machine-Readable Structured Data, Proceedings of the 13th Conference on Language Resources and Evaluation (LREC), pp. 1317-1325, Marseille, 20-25 June 2022. Linking to the relevant page(s) under https://kaikki.org would also be greatly appreciated.